The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Train Scheduling Problem with Consideration of Praying Constraint as an Application of Job Shop Scheduling Problem

The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...

متن کامل

An Adaptive Problem-Solving Solution to Large-Scale Scheduling Problems

Although the general class of most scheduling problems is NP-hard in worst-case complexity, in practice, domain-specific techniques frequently solve problems in much better than exponential time. Unfortunately, constructing special-purpose systems is a knowledge–intensive and time-consuming process that requires a deep understanding of the domain and problem-solving architecture. The goal of ou...

متن کامل

Airport Gate Assignment Considering Ground Movement

Airports all over the world are becoming busier and many of them are facing capacity problems. The actual airport capacity strongly depends on the efficiency of the resource utilisation. Although simultaneously handling all of the problems may result in more effective resource utilisation, historically different types of airport resources have been handled independently. Despite introducing new...

متن کامل

The over-constrained airport gate assignment problem

In this paper, we study the over-constrained airport gate assignment problem where the objectives are to minimize the number of ungated 4ights and total walking distances or connection times. We 7rst use a greedy algorithm to minimize ungated 4ights. Exchange moves are employed to facilitate the use of heuristics. Simulated annealing and a hybrid of simulated annealing and tabu search are used....

متن کامل

The Airport Gate Assignment Problem: A Survey

The airport gate assignment problem (AGAP) is one of the most important problems operations managers face daily. Many researches have been done to solve this problem and tackle its complexity. The objective of the task is assigning each flight (aircraft) to an available gate while maximizing both conveniences to passengers and the operational efficiency of airport. This objective requires a sol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Scheduling

سال: 2020

ISSN: 1094-6136,1099-1425

DOI: 10.1007/s10951-019-00635-5